What does it mean to not be injective?
I'm trying to understand the concept of not being injective in mathematical functions. Specifically, I want to know what it implies when a function fails to be injective, and how it affects the relationship between input and output values in the function.
How do you prove something is not injective?
Could you please elaborate on the process of demonstrating that a function is not injective? Could you provide an example or two to illustrate the concept? I'm having some difficulty understanding how to conclusively show that a given function fails to be injective. Could you guide me through the steps of identifying a non-injective function and explaining the reasoning behind it? It would be helpful if you could also mention any common pitfalls or misconceptions that students tend to fall into when attempting to prove non-injectivity. Thank you for your assistance in clarifying this concept.